Scheduling Tasks and Communications on a Hierarchical System with Message Contention
Identifieur interne : 000695 ( France/Analysis ); précédent : 000694; suivant : 000696Scheduling Tasks and Communications on a Hierarchical System with Message Contention
Auteurs : Jean-Yves Colin [France] ; Moustafa Nakechbandi [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2011.
Abstract
Abstract: A Directed Acyclic Graph (DAG) of tasks with small communication delays has to be scheduled on the identical parallel processors of clusters connected by a hierarchical network. The number or processors and of clusters is not limited. Message contention has to be avoided. Task duplication is allowed. In this paper, we present a new polynomial algorithm that computes the earliest start dates of all tasks and spreads these tasks to use few processors per cluster, for a DAG with small communication delays. It also avoids message contention, and always delivers messages on time.
Url:
DOI: 10.1007/978-3-642-24669-2_9
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000898
- to stream Istex, to step Curation: 000898
- to stream Istex, to step Checkpoint: 000101
- to stream Main, to step Merge: 000815
- to stream Main, to step Curation: 000814
- to stream Main, to step Exploration: 000814
- to stream France, to step Extraction: 000695
Links to Exploration step
ISTEX:A600F07245737974DAEF70E06078363BBFC68B93Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Scheduling Tasks and Communications on a Hierarchical System with Message Contention</title><author><name sortKey="Colin, Jean Yves" sort="Colin, Jean Yves" uniqKey="Colin J" first="Jean-Yves" last="Colin">Jean-Yves Colin</name></author><author><name sortKey="Nakechbandi, Moustafa" sort="Nakechbandi, Moustafa" uniqKey="Nakechbandi M" first="Moustafa" last="Nakechbandi">Moustafa Nakechbandi</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:A600F07245737974DAEF70E06078363BBFC68B93</idno><date when="2011" year="2011">2011</date><idno type="doi">10.1007/978-3-642-24669-2_9</idno><idno type="url">https://api.istex.fr/document/A600F07245737974DAEF70E06078363BBFC68B93/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000898</idno><idno type="wicri:Area/Istex/Curation">000898</idno><idno type="wicri:Area/Istex/Checkpoint">000101</idno><idno type="wicri:doubleKey">0302-9743:2011:Colin J:scheduling:tasks:and</idno><idno type="wicri:Area/Main/Merge">000815</idno><idno type="wicri:Area/Main/Curation">000814</idno><idno type="wicri:Area/Main/Exploration">000814</idno><idno type="wicri:Area/France/Extraction">000695</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Scheduling Tasks and Communications on a Hierarchical System with Message Contention</title><author><name sortKey="Colin, Jean Yves" sort="Colin, Jean Yves" uniqKey="Colin J" first="Jean-Yves" last="Colin">Jean-Yves Colin</name><affiliation wicri:level="4"><country xml:lang="fr">France</country><wicri:regionArea>LITIS, Université du Havre, IUT, 76610, Le Havre</wicri:regionArea><placeName><region type="region" nuts="2">Région Normandie</region><region type="old region" nuts="2">Haute-Normandie</region><settlement type="city">Le Havre</settlement></placeName><orgName type="university">Université du Havre</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Nakechbandi, Moustafa" sort="Nakechbandi, Moustafa" uniqKey="Nakechbandi M" first="Moustafa" last="Nakechbandi">Moustafa Nakechbandi</name><affiliation wicri:level="4"><country xml:lang="fr">France</country><wicri:regionArea>LITIS, Université du Havre, IUT, 76610, Le Havre</wicri:regionArea><placeName><region type="region" nuts="2">Région Normandie</region><region type="old region" nuts="2">Haute-Normandie</region><settlement type="city">Le Havre</settlement></placeName><orgName type="university">Université du Havre</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2011</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">A600F07245737974DAEF70E06078363BBFC68B93</idno><idno type="DOI">10.1007/978-3-642-24669-2_9</idno><idno type="ChapterID">9</idno><idno type="ChapterID">Chap9</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: A Directed Acyclic Graph (DAG) of tasks with small communication delays has to be scheduled on the identical parallel processors of clusters connected by a hierarchical network. The number or processors and of clusters is not limited. Message contention has to be avoided. Task duplication is allowed. In this paper, we present a new polynomial algorithm that computes the earliest start dates of all tasks and spreads these tasks to use few processors per cluster, for a DAG with small communication delays. It also avoids message contention, and always delivers messages on time.</div></front></TEI><affiliations><list><country><li>France</li></country><region><li>Haute-Normandie</li><li>Région Normandie</li></region><settlement><li>Le Havre</li></settlement><orgName><li>Université du Havre</li></orgName></list><tree><country name="France"><region name="Région Normandie"><name sortKey="Colin, Jean Yves" sort="Colin, Jean Yves" uniqKey="Colin J" first="Jean-Yves" last="Colin">Jean-Yves Colin</name></region><name sortKey="Colin, Jean Yves" sort="Colin, Jean Yves" uniqKey="Colin J" first="Jean-Yves" last="Colin">Jean-Yves Colin</name><name sortKey="Nakechbandi, Moustafa" sort="Nakechbandi, Moustafa" uniqKey="Nakechbandi M" first="Moustafa" last="Nakechbandi">Moustafa Nakechbandi</name><name sortKey="Nakechbandi, Moustafa" sort="Nakechbandi, Moustafa" uniqKey="Nakechbandi M" first="Moustafa" last="Nakechbandi">Moustafa Nakechbandi</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/France/explor/LeHavreV1/Data/France/Analysis
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000695 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/France/Analysis/biblio.hfd -nk 000695 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/France
|area= LeHavreV1
|flux= France
|étape= Analysis
|type= RBID
|clé= ISTEX:A600F07245737974DAEF70E06078363BBFC68B93
|texte= Scheduling Tasks and Communications on a Hierarchical System with Message Contention
}}
| This area was generated with Dilib version V0.6.25. |  |